Adaptive State Space Partitioning for Dynamic Decision Processes
نویسندگان
چکیده
منابع مشابه
Dynamic State Space Partitioning for Adaptive Simulation Algorithms
Adaptive simulation algorithms can automatically change their configuration during runtime to adapt to changing computational demands of a simulation, e.g., triggered by a changing number of model entities or the execution of a rare event. These algorithms can improve the performance of simulations. They can also reduce the configuration effort of the user. By using such algorithms with machine...
متن کاملElastic Resource Management with Adaptive State Space Partitioning of Markov Decision Processes
Modern large-scale computing deployments consist of complex applications running over machine clusters. An important issue in these is the offering of elasticity, i.e., the dynamic allocation of resources to applications to meet fluctuating workload demands. Threshold based approaches are typically employed, yet they are difficult to configure and optimize. Approaches based on reinforcement lea...
متن کاملDynamic State Space Partitioning for External Memory Model Checking
We describe a dynamic partitioning scheme usable by model checking techniques that divide the state space into partitions, such as most external memory and distributed model checking algorithms. The goal of the scheme is to reduce the number of transitions that link states belonging to different partitions, and thereby limit the amount of disk access and network communication. We report on seve...
متن کاملMultimodel Control of Continuous Processes through State Space Phase Partitioning
The dynamics of systems are qualitatively characterized by phase transitions over system state spaces. We develop a methodology where a state space is partitioned and then partitions are lumped into phases which are combined to form finite state automata controllers of the underlying continuous system. We demonstrate the use of partitioning to create multimodels delineating levels of abstractio...
متن کاملDynamic State-Space Partitioning in External-Memory Graph Search
State-of-the-art external-memory graph search algorithms rely on a hash function, or equivalently, a state-space projection function, that partitions the stored nodes of the state-space search graph into groups of nodes that are stored as separate files on disk. The scalability and efficiency of the search depends on properties of the partition: whether the number of unique nodes in a file alwa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Business & Information Systems Engineering
سال: 2019
ISSN: 2363-7005,1867-0202
DOI: 10.1007/s12599-019-00582-7